0 N ov 1 99 6 CLASS 2 MOUFANG LOOPS , SMALL FRATTINI MOUFANG LOOPS , AND CODE LOOPS

نویسنده

  • TIM HSU
چکیده

Let L be a Moufang loop which is centrally nilpotent of class 2. We first show that the nuclearly-derived subloop (normal associator subloop) L∗ of L has exponent dividing 6. It follows that Lp (the subloop of L of elements of p-power order) is associative for p > 3. Next, a loop L is said to be a small Frattini Moufang loop, or SFML, if L has a central subgroup Z of order p such that C ∼= L/Z is an elementary abelian p-group. C is thus given the structure of what we call a coded vector space, or CVS. (In the associative/group case, CVS’s are either orthogonal spaces, for p = 2, or symplectic spaces with attached linear forms, for p > 2.) Our principal result is that every CVS may be obtained from an SFML in this way, and two SFML’s are isomorphic in a manner preserving the central subgroup Z if and only if their CVS’s are isomorphic up to scalar multiple. Consequently, we obtain the fact that every SFM 2-loop is a code loop, in the sense of Griess, and we also obtain a relatively explicit characterization of isotopy in SFM 3-loops. (This characterization of isotopy is easily extended to Moufang loops of class 2 and exponent 3.) Finally, we sketch a method for constructing any finite Moufang loop which is centrally nilpotent of class 2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Moufang Loops That Share Associator and Three Quarters of Their Multiplication Tables

Certain two constructions, due to Drápal, produce a group by modifying exactly one quarter of the Cayley table of another group. We present these constructions in a compact way, and generalize them to Moufang loops, using loop extensions. Both constructions preserve associators, the associator subloop, and the nucleus. We conjecture that two Moufang 2-loops of finite order n with equivalent ass...

متن کامل

Term Formulas for the Cyclic and Dihedral Constructions

Two constructions due to Drápal produce a group by modifying exactly one quarter of the Cayley table of another group. We present these constructions in a compact way, and generalize them to Moufang loops, using loop extensions. Both constructions preserve associators, the associator subloop, and the nucleus. We conjecture that two Moufang 2-loops of finite order n with equivalent associator ca...

متن کامل

Direct construction of code loops

Code loops were introduced by R. L. Griess. Griess [5] and Hsu [7] gave methods to construct the corresponding code loop from any given doubly even binary code; both these methods used some kind of induction. In this paper, we present a global construction of the loop, where we apply the correspondance between the concepts of Moufang loops and groups with triality.

متن کامل

Ja n 20 07 COMBINATORIAL ASPECTS OF CODE LOOPS

The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T.Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E....

متن کامل

Combinatorial polarization, code loops, and codes of high level

We first find the combinatorial degree of any map f : V → F where F is a finite field and V is a finite-dimensional vector space over F . We then simplify and generalize a certain construction due to Chein and Goodaire that was used in characterizing code loops as finite Moufang loops that posses at most two squares. The construction yields binary codes of high divisibility level with prescribe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996